Superposition in branching allocation problems
نویسندگان
چکیده
منابع مشابه
Superposition Coding Scheme for Subcarrier & Bit Allocation in OFDM System
Orthogonal Frequency Division Multiple Access (OFDMA) refers to aradio transmission technique based on dividing the frequency channelinto narrowband sub-channels. In this dissertation studied that margin adaptive superposition coding (MA-SC) algorithm and rate adaptive superposition coding (RA-SC) algorithm, where at most two users can share each subcarrier as compared to MA and RA algorithm, w...
متن کاملRailway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway network. Although it can be modeled as a standard path packing problem, instances of sizes relevant for real-world railway applications could not be solved up to now. We propose a rapid branching column generation approach t...
متن کاملResource Allocation for Downlink Channel Transmission Based on Superposition Coding
We analyze the problem of transmitting information to multiple users over a shared wireless channel. The problem of resource allocation (RA) for the users with the knowledge of their channel state information has been treated extensively in the literature where various approaches trading off the users’ throughput and fairness were proposed. The emphasis was mostly on the time-sharing (TS) appro...
متن کاملAdaptive hierarchical modulation and power allocation for superposition-coded relaying
We propose a relaying scheme based on superposition coding (SC) with discrete adaptive modulation and coding (AMC) for a three-node wireless relay system, based on half duplex transmission, where each node decodes messages by successive interference cancelation (SIC). Unlike the previous works where the transmission rate of each link is assumed to achieve Gaussian channel capacity, we design a ...
متن کاملBranching Problems of Unitary Representations
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs discretely with finite multiplicity (admissible restrictions). Basic theory and new perspectives of admissible restrictions are presented from both analytic and alge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1965
ISSN: 0022-247X
DOI: 10.1016/0022-247x(65)90054-5